Polynomial bounds for invariant functions separating orbits
نویسندگان
چکیده
منابع مشابه
Invariant Polynomial Functions on k qudits
We study the polynomial functions on tensor states in (Cn)⊗k which are invariant under SU(n). We describe the space of invariant polynomials in terms of symmetric group representations. For k even, the smallest degree for invariant polynomials is n and in degree n we find a natural generalization of the determinant. For n, d fixed, we describe the asymptotic behavior of the dimension of the spa...
متن کاملProbability Bounds for Polynomial Functions in Random Variables
Random sampling is a simple but powerful method in statistics and the design of randomized algorithms. In a typical application, random sampling can be applied to estimate an extreme value, say maximum, of a function f over a set S ⊆ R. To do so, one may select a simpler (even finite) subset S0 ⊆ S, randomly take some samples over S0 for a number of times, and pick the best sample. The hope is ...
متن کاملOn lower bounds for integration of multivariate permutation-invariant functions
In this note we study multivariate integration for permutation-invariant functions from a certain Banach space Ed,α of Korobov type in the worst case setting. We present a lower error bound which particularly implies that in dimension d every cubature rule which reduces the initial error necessarily uses at least d+ 1 function values. Since this holds independently of the number of permutation-...
متن کاملPerturbation bounds for $g$-inverses with respect to the unitarily invariant norm
Let complex matrices $A$ and $B$ have the same sizes. Using the singular value decomposition, we characterize the $g$-inverse $B^{(1)}$ of $B$ such that the distance between a given $g$-inverse of $A$ and the set of all $g$-inverses of the matrix $B$ reaches minimum under the unitarily invariant norm. With this result, we derive additive and multiplicative perturbation bounds of the nearest per...
متن کاملBounds on separating redundancy
It is known that any linear code allows for a decoding strategy that treats errors and erasures separately over an error-erasure channel. In particular, a carefully designed paritycheck matrix makes efficient erasure correction possible through iterative decoding while instantly providing the necessary paritycheck equations for independent error correction on demand. The separating redundancy o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2012
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2012.03.008